Research on Asymmetry of Two-Queue Cycle Query Threshold Service Polling System
نویسندگان
چکیده
Based on establishing the mathematical model of system provided parameters, using discrete-time Markov chain and a function set by non-negative integer random variable as Probabilistic methods, discrete time variable, two-queue different gated polling has been fully analyzed, low- higher-order properties cycle period are deduced, average queue pair length waiting delay for message packets calculated accurately. The simulation experiments agree well with theoretical calculations. analysis further deepens cognition asymmetric threshold system, lays foundation researches positive significance better more flexible control periodic query work system.
منابع مشابه
On two-queue Markovian polling systems with exhaustive service
We consider a class of two-queue polling systems with exhaustive service, where the order in which the server visits the queues is governed by a discrete-time Markov chain. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we obtain explicit expressions for the Laplace-Stieltjes trans...
متن کاملFeature Analysis on Queue Length of Asymmetric Two-queue Polling System with Gated Services
On the basis of establishing mathematical model and defining the parameters and treating embedded Markov chains and probability generating function as math tools, the paper analyzed discrete-time, nonsymmetric dual-threshold service queue system precisely, and it derived first order and second order characteristics of the system. The paper calculates the average queue length and average waiting...
متن کاملOn the optimal control of a two-queue polling model
This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the long-run expected average cost of holding units and switching actions of the server, and the bias vector.
متن کاملOptimal routing in two-queue polling systems
We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times with rate μ in each queue. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a...
متن کاملTwo-Queue Polling Systems with Switching Policy Based on the Queue which is Not Being Served
We study a system of two non-identical and separate M/M/1/• queues with capacities (buffers) C1 < ∞ and C2 = ∞, respectively, served by a single server that alternates between the queues. The server’s switching policy is threshold-based, and, in contrast to other threshold models, is determined by the state of the queue that is not being served. That is, when neither queue is empty while the se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2022
ISSN: ['2158-107X', '2156-5570']
DOI: https://doi.org/10.14569/ijacsa.2022.0131275